2.6 KB · ⇊ 2 parts · ⤓ Micron 2.6 KB · ⤓ HTML 9.4 KB

top

In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality.

Unless P = NP, an exact algorithm for an NP-hard optimization problem cannot run in worst-case polynomial time. There has been extensive research on finding exact algorithms whose running time is exponential with a low base.cite-ref-1[1] cite-ref-2[2]

• See also

• References

• Approximation-preserving reduction

• APX is the class of problems with some constant-factor approximation algorithm

• Heuristic algorithm

• PTAS - a type of approximation algorithm that takes the approximation ratio as a parameter

cite-note-11. ↑ citereffominkaski2013Fomin, Fedor V.; Kaski, Petteri (March 2013), "Exact Exponential Algorithms", Communications of the ACM, 56 (3): 80–88, doi:10.1145/2428556.2428575.

cite-note-22. ↑ citereffominkratsch2010Fomin, Fedor V.; Kratsch, Dieter (2010). Exact Exponential Algorithms. Springer. p. 203. ISBN 978-3-642-16532-0.